General Policies, Representations, and Planning Width

Width-Based Planning for General Video-Game Playing

IW(1) is a simple search algorithm that assumes that states can be characterized in terms of a set of boolean features or atoms. IW(1) consists of a standard breadth-first search with one variation: a newly generated state is pruned if it does not make a new atom true. Thus, while a breadth-first search runs in time that is exponential in the number of atoms, IW(1) runs in linear time. Variatio...

Iran’s Shift in Family Planning Policies: Concerns and Challenges

Iran’s significant success in implementing Family Planning (FP) during the past 25 years, has made it a role model in the world. The Total Fertility Rate (TFR) in Iran has dropped from 6.5 in 1960 to 1.6 in 2012, which is well below the targeted value of 2.2 for the country. Iran’s success story, however, did not merely root in the implementation of FP programs. In other words, families’ strong...

compactifications and representations of transformation semigroups

this thesis deals essentially (but not from all aspects) with the extension of the notion of semigroup compactification and the construction of a general theory of semitopological nonaffine (affine) transformation semigroup compactifications. it determines those compactification which are universal with respect to some algebric or topological properties. as an application of the theory, it is i...

Width and Serialization of Classical Planning Problems

We introduce a width parameter that bounds the complexity of classical planning problems and domains, along with a simple but effective blind-search procedure that runs in time that is exponential in the problem width. We show that many benchmark domains have a bounded and small width provided that goals are restricted to single atoms, and hence that such problems are provably solvable in low p...

Width-Optimal Visibility Representations of Plane Graphs